Learning to rank on graphs

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Effective Learning to Rank Persian Web Content

Persian language is one of the most widely used languages in the Web environment. Hence, the Persian Web includes invaluable information that is required to be retrieved effectively. Similar to other languages, ranking algorithms for the Persian Web content, deal with different challenges, such as applicability issues in real-world situations as well as the lack of user modeling. CF-Rank, as a ...

متن کامل

On the Rank of Graphs

The properties of singular graphs obtained in a previous paper "On the construction of graphs of nullity one", lead to the characterization of graphs of small rank. The minimal configurations that are contained in singular graphs were identified as "grown" from certain cores. A core of a singular graph G is a subgraph induced by the vertices corresponding to the non-zero components of an eigenv...

متن کامل

On Rank Functions of Graphs

We study rank functions (also known as graph homomorphisms onto Z), ways of imposing graded poset structures on graphs. We first look at a variation on rank functions called discrete Lipschitz functions. We relate the number of Lipschitz functions of a graph G to the number of rank functions of both G and G× E . We then find generating functions that enable us to compute the number of rank or L...

متن کامل

Learning to Rank based on Analogical Reasoning

Object ranking or “learning to rank” is an important problem in the realm of preference learning. On the basis of training data in the form of a set of rankings of objects represented as feature vectors, the goal is to learn a ranking function that predicts a linear order of any new set of objects. In this paper, we propose a new approach to object ranking based on principles of analogical reas...

متن کامل

Machine Comprehension Based on Learning to Rank

Machine comprehension plays an essential role in NLP and has been widely explored with dataset like MCTest. However, this dataset is too simple and too small for learning true reasoning abilities. (Hermann et al., 2015) therefore release a large scale news article dataset and propose a deep LSTM reader system for machine comprehension. However, the training process is expensive. We therefore tr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Machine Learning

سال: 2010

ISSN: 0885-6125,1573-0565

DOI: 10.1007/s10994-010-5185-8